Semi-duality and the cycle double cover conjecture
نویسندگان
چکیده
منابع مشابه
Catherine Greenhill the Cycle Double Cover Conjecture
In the year 2000, exactly one hundred years after David Hilbert posed his now famous list of 23 open problems, The Clay Mathematics Institute (CMI) announced its seven Millennium Problems. (http://www. claymath.org/millennium). The Gazette has asked leading Australian mathematicians to put forth their own favourite ‘Millennium Problem’. Due to the Gazette’s limited budget, we are unfortunately ...
متن کاملOn the oriented perfect path double cover conjecture
An oriented perfect path double cover (OPPDC) of a graph $G$ is a collection of directed paths in the symmetric orientation $G_s$ of $G$ such that each arc of $G_s$ lies in exactly one of the paths and each vertex of $G$ appears just once as a beginning and just once as an end of a path. Maxov{'a} and Ne{v{s}}et{v{r}}il (Discrete Math. 276 (2004) 287-294) conjectured that ...
متن کاملA survey of the cycle double cover conjecture
This conjecture has been attributed variously to many mathematicians, but was known to be a consequence of the Strong Embedding Conjecture (Conjecture 2) by W. Tutte, G. Haggard, as well as by G. Szekeres and P. Seymour, amongst others [18], [16]. In what follows, we survey some of what is known about the above conjecture and discuss various related problems and techniques. We discuss the stron...
متن کاملOn a conjecture of Keedwell and the cycle double cover conjecture
At the 16th British Combinatorial Conference (1997), Cameron introduced a new concept called 2-simultaneous coloring. He used this concept to reformulate a conjecture of Keedwell (1994) on the existence of critical partial latin squares of a given type. Using computer programs, we have veri ed the truth of the above conjecture (the SE conjecture) for all graphs having less than 29 edges. In thi...
متن کاملon the oriented perfect path double cover conjecture
an oriented perfect path double cover (oppdc) of a graph $g$ is a collection of directed paths in the symmetric orientation $g_s$ of $g$ such that each arc of $g_s$ lies in exactly one of the paths and each vertex of $g$ appears just once as a beginning and just once as an end of a path. maxov{'a} and ne{v{s}}et{v{r}}il (discrete math. 276 (2004) 287-294) conjectured that ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1986
ISSN: 0095-8956
DOI: 10.1016/0095-8956(86)90054-7